منابع مشابه
A Convex Approach to Minimal Partitions
We describe a convex relaxation for a family of problems of minimal perimeter partitions. The minimization of the relaxed problem can be tackled numerically, we describe an algorithm and show some results. In most cases, our relaxed problem finds a correct numerical approximation of the optimal solution: we give some arguments to explain why it should be so, and also discuss some situation wher...
متن کاملA convex approach for computing minimal partitions
We describe a convex relaxation for a family of problems of minimal perimeter partitions. The minimization of the relaxed problem can be tackled numerically, we describe an algorithm and show some results. In most cases, our relaxed problem nds a correct (approximate) solution: we give some arguments to explain why it should be so, and also discuss some situation where it fails.
متن کاملA local approach to the entropy of countable fuzzy partitions
This paper denes and investigates the ergodic proper-ties of the entropy of a countable partition of a fuzzy dynamical sys-tem at different points of the state space. It ultimately introducesthe local fuzzy entropy of a fuzzy dynamical system and proves itto be an isomorphism invariant.
متن کاملInstitut für Informatik III der Rheinischen Friedrich-Wilhelms-Universität Bonn A convex approach for computing minimal partitions
We describe a convex relaxation for a family of problems of minimal perimeter partitions. The minimization of the relaxed problem can be tackled numerically, we describe an algorithm and show some results. In most cases, our relaxed problem finds a correct (approximate) solution: we give some arguments to explain why it should be so, and also discuss some situation where it fails.
متن کاملMinimal r-Complete Partitions
A minimal r-complete partition of an integer m is a partition of m with as few parts as possible, such that all the numbers 1, . . . , rm can be written as a sum of parts taken from the partition, each part being used at most r times. This is a generalization of M-partitions (minimal 1-complete partitions). The number of M-partitions of m was recently connected to the binary partition function ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Imaging Sciences
سال: 2012
ISSN: 1936-4954
DOI: 10.1137/110856733